翻訳と辞書 Words near each other ・ Fruit of Life ・ Fruit of Paradise ・ Fruit of the Holy Spirit ・ Fruit of the Loom ・ Fruit of the poisonous tree ・ Fruit of the Poisonous Tree (Once Upon a Time) ・ Fruit Park Station ・ Fruit picking ・ Fruit Pie the Magician ・ Fruit pit carving ・ Fruit preserves ・ Fruit press ・ Fruit production in Iran ・ Fruit pudding ・ Fruit Ridge (Michigan) ・ Frucht's theorem ・ Fruchtschiefer ・ Frucor ・ Frucourt ・ FRUCT ・ Fructan ・ Fructan beta-(2,1)-fructosidase ・ Fructan beta-(2,6)-fructosidase ・ Fructan beta-fructosidase ・ Fructidor ・ Fructification ・ Fructokinase ・ Fructolysis ・ Fructone ・ Fructooligosaccharide Dictionary Lists mini英和辞書 mini和英辞書 Webster 1913 Latin-English FOLDOC Wikipedia English ウィキペディア

翻訳と辞書　辞書検索 [ 開発暫定版 ] スポンサード リンク Frucht's theorem ： ウィキペディア英語版 Frucht's theorem Frucht's theorem is a theorem in algebraic graph theory conjectured by Dénes Kőnig in 1936 and proved by Robert Frucht in 1939. It states that every finite group is the group of symmetries of a finite undirected graph. More strongly, for any finite group ''G'' there exist infinitely many non-isomorphic simple connected graphs such that the automorphism group of each of them is isomorphic to ''G''. ==Proof idea== The main idea of the proof is to observe that the Cayley graph of ''G'', with the addition of colors and orientations on its edges to distinguish the generators of ''G'' from each other, has the desired automorphism group. Therefore, if each of these edges is replaced by an appropriate subgraph, such that each replacement subgraph is itself asymmetric and two replacements are isomorphic if and only if they replace edges of the same color, then the undirected graph created by performing these replacements will also have ''G'' as its symmetry group.〔, discussion following Theorem 4.1.〕 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Frucht's theorem」の詳細全文を読む スポンサード リンク 翻訳と辞書 : 翻訳のためのインターネットリソース Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.